Some Results on Small Context-free Grammars Generating Primitive Words
نویسنده
چکیده
In this report we characterize all context-free grammars with not more than three nonterminals generating only primitive words. 1This work was supported by the German-Hungarian Research Project 102 of OMFB ( Hungarian Research Foundation ) and Project X 233.6 of Forschungszentrum Karlsruhe
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملOrdered Construction of Combinatorial Objects
The generating function method for counting species of combinatorial objects is applied to the construction of the objects in order. The species considered are those described using context-free grammars with additional group-invariant operators. Some species constructible with this method are integer partitions, rooted trees of specified or unbounded degree including binary and ordered trees, ...
متن کاملThe Simple Language Generator: Encoding complex languages with simple grammars
This paper introduces the design and use of the Simple Language Generator (SLG). SLG allows the user to construct small but interesting stochastic context-free languages with relative ease. Although context-free grammars are convenient for representing natural language syntax, they do not easily support the semantic and pragmatic constraints that make certain combinations of words or structures...
متن کاملGenerating Context-Free Grammars using Classical Planning
This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementi...
متن کاملFully Lexicalized Pregroup Grammars
Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...
متن کامل